A combinatorial problem in the $k$-adic number system
نویسندگان
چکیده
منابع مشابه
On a Combinatorial Problem in Number Theory
1. Introduction One of the problems mentioned injl] (on p. 187) concerns the estimation of the magnitude of the largest number g(N) such that, from every sequence of N distinct natural numbers, one can always select a subsequence of g{N) integers with the property that no sum of two distinct integers of this subsequence belongs to the original sequence. It should be mentioned that the function ...
متن کاملNumber of Minimal Path Sets in a Consecutive-k-out-of-n: F System
In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...
متن کاملThe Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملOn a Problem in Elementary Number Theory and a Combinatorial Problem
(1) f~(n) < exp [(log n) 1 /2 ]E Recently, I observed that using a combinatorial theorem due to Rado and myself (1) can be considerably improved and it might, in fact, be possible to obtain the correct order of magnitude for f 1 (n) . The combinatorial theorem in question states as follows [2] : Let g(k, t) be the smallest integer so that if A 1 , • • • , A 8 , s = g(k, t), are sets each having...
متن کاملCombinatorial relaxations of the k-traveling salesman problem
The k-traveling salesman problem, or k-TSP is: given a graph with edge weights and an integer k, find a simple cycle of minimum weight visiting exactly k nodes. To obtain lower bounds for the traveling salesman problem the 2-matching relaxation and the 1-tree relaxation can be used. We generalize these two relaxations for the k-TSP.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1967
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1967-0207568-x